Computation Paths Logic: An Expressive, yet Elementary, Process Logic
نویسندگان
چکیده
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr extensions for modeling asynchronouaisynchronous concurrency and infinite computanons. All extensions are also shown to be decidable in elementary time. :g 1999 Elsevicr Scicncr B.V. All rights reserved. K<S~~l~,ort/.s: Process logic: Dynamic logic: Temporal logic: Computation paths
منابع مشابه
Computation Paths Logic :
A new process logic is deened, called computation paths logic (CPL), which treats formulas and programs essentially alike. CPL is a pathwise extension of PDL, following the basic process logic of Harel, Kozen and Parikh, and is close in spirit to the logic R of Harel and Peleg. It enjoys most of the advantages of previous process logics, yet is decidable in elementary time. We also ooer extensi...
متن کاملCounting on CTL*: on the expressive power of monadic path logic
Monadic second-order logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting second-order quantification to paths reflecting computation sequences. In this paper we show that the expressive power of MPL over trees coincides with the usual branching time logic CTL∗ embellished with a simple ...
متن کاملA Clausal Resolution Method for Extended Computation Tree Logic ECTL
A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logic...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملModel Based Deduction for Database Schema Reasoning
We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query reasoning. Specifically, we present an approach to compute completed paths for database or XPath queries. The database schema and a query are transformed to disjunctive logic programs with default negation, using a description lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 96 شماره
صفحات -
تاریخ انتشار 1999